A shape matching approach for scheduling fine-grained parallelism
نویسندگان
چکیده
منابع مشابه
Provably Eecient Scheduling for Languages with Fine-grained Parallelism
Many high-level parallel programming languages allow for ne-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such languages can express the full parallelism in the program without specifying the mapping of program tasks to processors. A common concern in executing such programs is to dynamically schedule tasks to processors so as to n...
متن کاملProvably E cient Scheduling for Languages with Fine Grained Parallelism
Many high level parallel programming languages allow for ne grained parallelism As in the popular work time frame work for parallel algorithm design programs written in such languages can express the full parallelism in the program without specifying the mapping of program tasks to proces sors A common concern in executing such programs is to schedule tasks to processors dynamically so as to mi...
متن کاملTasklettes - A Fine Grained Parallelism for Ada on Multicores
The widespread use of multi-CPU computers is challenging programming languages, which need to adapt to be able to express potential parallelism at the language level. In this paper we propose a new model for fine grained parallelism in Ada, putting forward a syntax based on aspects, and the corresponding semantics to integrate this model with the existing Ada tasking capabilities. We also propo...
متن کاملExposing Fine - Grained Parallelism in Algebraic Multigrid
Algebraic multigrid methods for large, sparse linear systems are a necessity in many computational simulations, yet parallel algorithms for such solvers are generally decomposed into coarse-grained tasks suitable for distributed computers with traditional processing cores. However, accelerating multigrid methods on massively parallel throughput-oriented processors, such as graphics processing u...
متن کاملMeasuring Limits of Fine-grained Parallelism
First, the limits of low-level parallelism for a collection of real-world programs are investigated and Wall's results are veri ed. Maximum parallelism of symbolic benchmarks is investigated on both superpipelined and superscalar architectures. E ects of register renaming are considered. We then examine the e ects of garbage collection strategies on low-level parallelism. In particular, we exam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMICRO Newsletter
سال: 1992
ISSN: 1050-916X
DOI: 10.1145/144965.145826